Quantum key-recovery attack on Feistel structures
نویسندگان
چکیده
منابع مشابه
Quantum Key-recovery Attack on Feistel Structures
Post-quantum cryptography has attracted much attention from worldwide cryptologists. At Asiacrypt 2017, Leander and May combines Grover and Simon algorithms to quantumly break FX-based block ciphers. In this paper, we study the Feistel constructions with Grover and Simon algorithms and give some new quantum key-recovery attacks on different rounds of Feistel constructions. Our attacks requires ...
متن کاملGeneric Key Recovery Attack on Feistel Scheme
We propose new generic key recovery attacks on Feistel-type block ciphers. The proposed attack is based on the all subkeys recovery approach presented in SAC 2012, which determines all subkeys instead of the master key. This enables us to construct a key recovery attack without taking into account a key scheduling function. With our advanced techniques, we apply several key recovery attacks to ...
متن کاملA Related Key Attack on the Feistel Type Block Ciphers
In this paper we show that Biham’s chosen key attack can be generalized to include any block cipher and we give a low complexity chosen key attack on any Feistel type cipher. Then we show that the irregularities in the shift pattern of DES key schedule algorithm is not sufficient for the cryptosystem to resist against related key attacks. We have realized our proposition by a counter example in...
متن کاملKey Recovery Attack on QuiSci
QuiSci is incredible fast, faster than most other ciphers. On modern CPUs it needs only arround 1 clock cycle per byte, so it is 10 times fast than most other well-known algorithm. On the website of QuiSci [1] it is claimed that this algorithm is secure. With this paper I like to show a key recovery attack on QuiSci, exploiting the weak key setup. When you are able to guess the beginning of the...
متن کاملPractical Key-Recovery Attack on MANTIS5
MANTIS is a lightweight tweakable block cipher recently published at CRYPTO 2016. In addition to the full 14-round version, MANTIS7, the designers also propose an aggressive 10-round version, MANTIS5. The security claim for MANTIS5 is resistance against “practical attacks”, defined as related-tweak attacks with data complexity 2 less than 2 chosen plaintexts (or 2 known plaintexts), and computa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2018
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-017-9468-y